package LuoGu.字符串处理.笨小猴;

import java.util.Scanner;

public class Main{
    public static void main(String[] args){
        Scanner scanner = new Scanner(System.in);
        int [] check = new int [26];
        String temp = scanner.next();
        int ans = 0;
        int maxn = 0 , minn = Integer.MAX_VALUE;
        int n = temp.length();
        for(int i=0;i<n;i++){
            check[temp.charAt(i)-'a']++;
        }
        for(int i=0;i<26;i++){
            maxn = Math.max(check[i],maxn);
            if(check[i]>0) minn = Math.min(check[i],minn);
        }
        ans = maxn-minn;
        if(prime(ans)){
            System.out.println("Lucky Word");
            System.out.print(ans);
        }
        else{
            System.out.println("No Answer");
            System.out.print(0);
        }
    }

    static boolean prime(int ans){
        if(ans<2) return false;
        for(int i=2;i<Math.sqrt(ans);i++){
            if(ans%i==0) return false;
        }
        return true;
    }
}